Data Mining Rules Using Multi-Objective Evolutionary Algorithms

نویسندگان

  • Beatriz de la Iglesia
  • Mark S. Philpott
  • Anthony
  • Vic J. Rayward-Smith
چکیده

In data mining, nugget discovery is the discovery of interesting classification rules that apply to a target class. In previous research, heuristic methods (Genetic algorithms, Simulated Annealing and Tabu Search) have been used to optimise a single measure of interest. This paper proposes the use of multiobjective optimisation evolutionary algorithms to allow the user to interactively select a number of interest measures and deliver the best nuggets (an approximation to the Pareto-optimal set) according to those measures. Initial experiments are conducted on a number of databases, using an implementation of the Fast Elitist Non-Dominated Sorting Genetic Algorithm (NSGA), and two well known measures of interest. Comparisons with the results obtained using modern heuristic methods are presented. Results indicate the potential of multi-objective evolutionary algorithms for the task of nugget discovery.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Objective Sentiment Analysis Using Evolutionary Algorithm for Mining Positive & Negative Association Rules

Most of the algorithms for mining Quantitative Association Rules (QAR) focuses on positive dependencies without paying particular attention to negative dependencies. The latter may be worth taking into account, however, as they relate the presence of certain items to the absence of others. The algorithms used to extract such rules usually consider only one evaluation criterion in measuring the ...

متن کامل

An Evolutionary Multi-objective Discretization based on Normalized Cut

Learning models and related results depend on the quality of the input data. If raw data is not properly cleaned and structured, the results are tending to be incorrect. Therefore, discretization as one of the preprocessing techniques plays an important role in learning processes. The most important challenge in the discretization process is to reduce the number of features’ values. This operat...

متن کامل

Fuzzy rule selection by multi-objective genetic local search algorithms and rule evaluation measures in data mining

This paper shows how a small number of simple fuzzy if-then rules can be selected for pattern classi-cation problems with many continuous attributes. Our approach consists of two phases: candidate rule generation by rule evaluation measures in data mining and rule selection by multi-objective evolutionary algorithms. In our approach, -rst candidate fuzzy if-then rules are generated from numeric...

متن کامل

Multi-objective Association Rule Mining using Evolutionary Algorithm

Generally association rule mining (ARM) algorithms, like the apriori algorithm, initial produce frequent itemsets and afterward, from the frequent itemsets, the association rules that go beyond the minimum confidence threshold. When the data is in large volume, it takes number of scans to generate frequent items.It is a better idea if all the association rules generated directly without generat...

متن کامل

A Hybrid MOEA/D-TS for Solving Multi-Objective Problems

In many real-world applications, various optimization problems with conflicting objectives are very common. In this paper we employ Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), a newly developed method, beside Tabu Search (TS) accompaniment to achieve a new manner for solving multi-objective optimization problems (MOPs) with two or three conflicting objectives. This i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003